//Goldbach's Conjecture:https://www.luogu.com.cn/problem/UVA543

#include <iostream>

using namespace std;
const int N = 1e6 + 10;

int p[N];
bool st[N];
int cnt;

void judge(int n)
{
	for(int i = 1; i <= cnt; i++)
	{
		if(!st[n-p[i]])
		{
			printf("%d = %d + %d\n",n,p[i],n-p[i]);
			return;
		}
	}
	printf("Goldbach's conjecture is wrong.\n");
}
void get_prime()
{
	for(long long i = 2; i < N; i++)
	{
		if(!st[i])p[++cnt] = i;
		for(int j = 1; p[j]*i < N; j++)
		{
			st[p[j]*i]=true;
			if(i % p[j] == 0)break;
		}
	}
}



int main()
{
	get_prime();
	int n;
	while(scanf("%d",&n)&&n)
	{
		judge(n);
	}
	return 0;
}
